Complexity Issues within Eigenvalue-Based Multi- Antenna Spectrum Sensing

This chapter provides a deep insight into multiple antenna eigenvalue-based spectrum sensing algorithms from a complexity perspective. A review of eigenvalue-based spectrum-sensing algorithms is provided. The chapter presents a finite computational complexity analysis in terms of Floating Point Operations (flop) and a comparison of the Maximum-to-Minimum Eigenvalue (MME) detector and a simplified variant of the Multiple Beam forming detector as well as the Approximated MME method. Constant False Alarm Performances (CFAR) are presented to emphasize the complexity-reliability tradeoff within the spectrumsensing problem, given the strong requirements on the sensing duration and the detection performance.